Flexible Combinatorial Interaction Testing

We present Flexible Combinatorial Interaction Testing (F-CIT), which aims to improve the flexibility of combinatorial interaction testing (CIT) by eliminating necessity developing specialized constructors for CIT problems that cannot be efficiently and effectively addressed existing constructors. F-CIT expresses entities covered space valid test cases, from samples are drawn obtain full coverage, as constraints. Computing an object (i.e., a set cases obtaining coverage under given criterion) then turns into interesting constraint solving problem, we call cov-CSP . cov-CSP divide constraints, each representing entity covered, minimum number satisfiable clusters, such solution cluster represents case collection all generated (one per cluster) constitutes object, covering required at least once. To solve thus compute objects, first two One these attempts cover many possible in before generating case, whereas other constructor generates marks accommodated this covered. use evaluate three studies, addresses different problem. In study, develop structure-based objects decision coverage-adequate suites. second order-based enhance criteria taking reachability constraints imposed graph-based models directly account when computing third usage-based address scenarios, standard arrays not desirable due their sizes, choosing based on usage statistics collected field. also carry out user studies further F-CIT. The results suggest is more flexible than approaches.